A Branching Heuristics for Quantified Renamable Horn Formulas
نویسندگان
چکیده
Many solvers have been designed for QBFs, the validity problem for Quantified Boolean Formulas for the past few years. In this paper, we describe a new branching heuristics whose purpose is to promote renamable Horn formulas. This heuristics is based on Hébrard’s algorithm for the recognition of such formulas. We present some experimental results obtained by our qbf solver Qbfl with the new branching heuristics and show how its performances are improved.
منابع مشابه
A Modular Reduction of Regular Logic to Classical Logic
In this paper we first define a reduction Æ that transforms an instance of Regular-SAT into a satisfiability equivalent instance Æ of SAT. The reduction Æ has interesting properties: (i) the size of Æ is linear in the size of , (ii) Æ transforms regular Horn formulas into Horn formulas, and (iii) Æ transforms regular 2-CNF formulas into 2-CNF formulas. Second, we describe a new satisfiability t...
متن کاملExtending the Knowledge Compilation Map: Krom, Horn, Affine and Beyond
We extend the knowledge compilation map introduced by Darwiche and Marquis with three influential propositional fragments, the Krom CNF one (also known as the bijunctive fragment), the Horn CNF fragment and the affine fragment (also known as the biconditional fragment) as well as seven additional languages based on them, and composed respectively of Krom or Horn CNF formulas, renamable Horn CNF...
متن کاملA perspective on certain polynomial-time solvable classes of satisfiability
The scope of certain well-studied polynomial-time solvable classes of Satisfiability is investigated relative to a polynomial-time solvable class consisting of what we call matched formulas. The class of matched formulas has not been studied in the literature, probably because it seems not to contain many challenging formulas. Yet, we find that, in some sense, the matched formulas are more nume...
متن کاملComplexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases
This paper presents new complexity results for propositional closed world reasoning (CWR) from tractable knowledge bases (KBs). Both (basic) CWR, generalized CWR, extended generalized CWR, careful CWR and extended CWR (equivalent to circumscription) are considered. The focus is laid on tractable KBs belonging to target classes for exact compilation functions: Blake formulas, DNFs, disjunctions ...
متن کاملRecognizing Renamable Generalized Propositional Horn Formulas Is NP-complete
Yamasaki and Doshita have defined an extension of the class of propositional Horn formulas; later, Gallo and Scutellà generalized this class to a hierarchy Γ0 ⊆ Γ1 ⊆ . . . ⊆ Γk ⊆ . . ., where Γ0 is the set of Horn formulas and Γ1 is the class of Yamasaki and Doshita. For any fixed k, the propositional formulas in Γk can be recognized in polynomial time, and the satisfiability problem for Γk for...
متن کامل